A Comparison of Parallel and Sequential
نویسنده
چکیده
Niching methods extend genetic algorithms to domains that require the location of multiple solutions. This study examines and compares four niching methods | sharing, crowding, sequential niching, and parallel hillclimbing. It focuses on the diierences between parallel and sequential niching. The niching methods undergo rigorous testing on optimization and classiication problems of increasing diiculty. A niching-based technique is introduced that extends genetic algorithms to classiication problems.
منابع مشابه
Parallel Generation of t-ary Trees
A parallel algorithm for generating t-ary tree sequences in reverse B-order is presented. The algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time O(1). The algorithm is executed on a CREW SM SIMD model, and is adaptive and cost-optimal. Prior to the discussion of the parallel algorithm a new sequential generation with O(1) average time ...
متن کاملموازی سازی شبیه سازی پدیده ناپایداری دوجریانی به روش PIC
Two stream instability in plasma is simulated by PIC method. The execution time of the sequential and parallizable sections of the program is measured. The sequential program is parallelized with the help of the MPI functions. Then, the execution time of the sequential program versus the number of the grid points and the execution time of the parallel program on 3 and 5 processors versus the nu...
متن کاملComparison between four dissimilar solar panel configurations
Several studies on photovoltaic systems focused on how it operates and energy required in operating it. Little attention is paid on its configurations, modeling of mean time to system failure, availability, cost benefit and comparisons of parallel and series–parallel designs. In this research work, four system configurations were studied. Configuration I consists of two sub-components arranged ...
متن کاملA comparison of algorithms for minimizing the sum of earliness and tardiness in hybrid flow-shop scheduling problem with unrelated parallel machines and sequence-dependent setup times
In this paper, the flow-shop scheduling problem with unrelated parallel machines at each stage as well as sequence-dependent setup times under minimization of the sum of earliness and tardiness are studied. The processing times, setup times and due-dates are known in advance. To solve the problem, we introduce a hybrid memetic algorithm as well as a particle swarm optimization algorithm combine...
متن کاملSequential Deferoxamine - Deferasirox in Treatment of Major Thalassemia with Iron Overload
Abstract Background Iron overload is a major problem in patients with major thalassemia. An effective and safe iron chelator protocol with high compliance rate plays an important role in treatment of these patients. This study was done to assess the efficacy and safety of the sequential deferoxamine and deferasirox protocol in major thalassemia patients in Khuzestan province, Iran. Material ...
متن کاملA New Intelligent Controller for Parallel DC/DC Converters
In this paper, the immune controller, is used to control the paralleled DC-DC converters. A PID controller is first applied and its coefficient is optimized using an intelligent (PSO) algorithm. Immune controller is then added to PID controller and an immune PID controller is formed. Two methods have been suggested to determine non-linear behavior of immune controller. In the first method, an e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995